An Evaluation of Scalable Application-Level Multicast Built Using Peer-To-Peer Overlay Networks
ثبت نشده
چکیده
Peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general approaches to accomplishing this: tree building (used by Bayeux and Scribe); and flooding (used by CAN Multicast). This paper presents of an evaluation of these two approaches using CAN and Pastry as the underlying overlay networks. We chose CAN and Pastry as representatives of the two major kinds of peer-to-peer overlays. In particular, Chord, Pastry and Tapestry all use a form of generalized hypercube routing with longest-prefix matching, whereas CAN uses a numerical distance metric to route through a Cartesian hyper-space. To the best of our knowledge, this paper reports the first head-tohead comparison of CAN-style versus Pastry-style overlay networks, using multicast communication workloads running on an identical simulation infrastructure. Furthermore, we observe that the approach to multicast is independent of overlay network choice, and we then provide a head-to-head comparison of flooding versus tree-based multicast on both styles of overlays. We find that the tree-based multicast approach consistently outperforms the flooding approach. We show that the biggest disadvantage of the flooding approach is the cost of constructing a new overlay for each multicast group. Finally, for the tree-based multicast, we show that Pastry can optionally provide higher performance than CAN but
منابع مشابه
An Evaluation of Scalable Application-Level Multicast Built Using Peer-To-Peer Overlays
Structured peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general approaches to accomplishing this: tree building and flooding. This paper evaluates these two approaches using two different types of structured overlay: 1) overlays which use a form of generalized hypercube routing, e.g., Ch...
متن کاملPeer-to-Peer Overlay Multicast for Scalable Audiovisual Services over Converging Wired and Wireless Networks
The deployment of scalable audiovisual multicast services over heterogeneous core and access networks is a challenging problem. In this article we propose E-Cast, an efficient, source-specific, scalable, overlay multicast system based on the peer-to-peer system Kademlia. This novel overlay multicast system enables IPTV multicast to be deployed as a service level infrastructure to overcome IP ne...
متن کاملScalable Island Multicast for Peer-to-Peer Streaming
Despite the fact that global multicast is still not possible in today’s Internet, many local networks are already multicast-capable (the so-called multicast “islands”). However, most application-layer multicast (ALM) protocols for streaming have not taken advantage of the underlying IP multicast capability. As IP multicast is more efficient, it would be beneficial if ALM can take advantage of s...
متن کاملContent-Based Multicast: Comparison of Implementation Options
This paper is an attempt to quantify the performance differences for content-based multicast implemented inside the overlay routing algorithm or built on top of the simple API provided by the routing layer. We focus on overlay networks designed for peer-to-peer distributed hash table (DHT) applications where content-based multicast is most applicable. In particular we study the Content Addressa...
متن کامل